Splitting for optimization

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Splitting for optimization

The splitting method is a well-known method for rare-event simulation, where sample paths of a Markov process are split into multiple copies during the simulation, so as to make the occurrence of a rare event more frequent. Motivated by the splitting algorithm we introduce a novel global optimization method for continuous optimization that is both very fast and accurate. Numerical experiments d...

متن کامل

Block splitting for distributed optimization

This paper describes a general purpose method for solving convex optimization problems in a distributed computing environment. In particular, if the problem data includes a large linear operator or matrix A, the method allows for handling each sub-block of A on a separate machine. The approach works as follows. First, we define a canonical problem form called graph form, in which we have two se...

متن کامل

Splitting for Multi-objective Optimization

We introduce a new multi-objective optimization (MOO) methodology based the splitting technique for rare-event simulation. The method generalizes the elite set selection of the traditional splitting framework, and uses both local and global sampling to sample in the decision space. In addition, an ε-dominance method is employed to maintain good solutions. The algorithm was compared with state-o...

متن کامل

Fast Multiple-Splitting Algorithms for Convex Optimization

Abstract. We present in this paper two different classes of general K-splitting algorithms for solving finite-dimensional convex optimization problems. Under the assumption that the function being minimized has a Lipschitz continuous gradient, we prove that the number of iterations needed by the first class of algorithms to obtain an ε-optimal solution is O(1/ε). The algorithms in the second cl...

متن کامل

Composite splitting algorithms for convex optimization

Article history: Received 21 April 2010 Accepted 6 June 2011 Available online xxxx

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Computers & Operations Research

سال: 2016

ISSN: 0305-0548

DOI: 10.1016/j.cor.2016.04.015